Constraint solving on modular integers
نویسندگان
چکیده
Constraint solving over finite-sized integers involves the definition of propagators able to capture modular (a.k.a. wrap-around) integer computations. In this paper, we propose efficient propagators for a fragment of modular integer constraints including adders, multipliers and comparators. Our approach is based on the original notion of Clockwise Interval for which we define a complete arithmetic. We also present three distinct implementations of modular integer constraint solving in the context of software verification.
منابع مشابه
Problem Solving in the DISCO Constraint Database System
This paper describes general approaches to solving two classes of problems using the DISCO constraint database system. The rst class of problems occurs when distinct values from a subset of the integers must be assigned to the variables of a constraint satisfaction problem. The second occurs when a group of items must be selected from a subset of the integers such that each of a set of constrai...
متن کاملA Note on Mixed Set Programming
This short paper presents the “Mixed Set Programming” framework of NCL in modeling and solving constraint satisfaction problems over a mixed domain of reals, integers, Booleans, references, and sets. Modeling abstraction and the solving of a few hard combinatorial problems such as set partitioning and job-shop scheduling are illustrated.
متن کاملFinite Set Constraints in Oz
We report on the extension of the concurrent constraint language Oz by constraints over finite sets of integers. Set constraints are an important addition to the constraint programming system Oz and are very employable in natural language processing and general problem solving. This extension profits much from its integration with the existing constraint systems over finite domains and feature ...
متن کاملA fixed point approach to the Hyers-Ulam stability of an $AQ$ functional equation in probabilistic modular spaces
In this paper, we prove the Hyers-Ulam stability in$beta$-homogeneous probabilistic modular spaces via fixed point method for the functional equation[f(x+ky)+f(x-ky)=f(x+y)+f(x-y)+frac{2(k+1)}{k}f(ky)-2(k+1)f(y)]for fixed integers $k$ with $kneq 0,pm1.$
متن کاملA Uniied Framework for Solving Boolean, Integer and Set Constraints
In this short paper, a uniied framework for solving Boolean, integer and set constraints is presented. The computation model for solving conjunctions of primitive constraints, possibly with existential and universal quantiications, is described using rewrite rules. An important feature of the constraint solving model is that a variable's domain (set of integers) can be a constrained variable (s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010